Multi-Focusing on Extensional Rewriting with Sums
نویسنده
چکیده
We propose a logical justification for the rewriting-based equivalence procedure for simply-typed lambda-terms with sums of Lindley [Lin07]. It relies on maximally multi-focused proofs, a notion of canonical derivations introduced for linear logic. Lindley’s rewriting closely corresponds to preemptive rewriting [CMS08], a technical device used in the meta-theory of maximal multi-focus. 1998 ACM Subject Classification F.4.1 Lambda calculus and related systems
منابع مشابه
Extensional Rewriting with Sums
Inspired by recent work on normalisation by evaluation for sums, we propose a normalising and confluent extensional rewriting theory for the simply-typed λ-calculus extended with sum types. As a corollary of confluence we obtain decidability for the extensional equational theory of simply-typed λ-calculus extended with sum types. Unlike previous decidability results, which rely on advanced rewr...
متن کاملA Connuent Reduction for the Extensional Typed ?calculus with Pairs, Sums, Recursion and Terminal Object
We add extensional equalities for the functional and product types to the typed-calculus with not only products and terminal object, but also sums and bounded recursion (a version of recursion that does not allow recursive calls of innnite length). We provide a connuent and strongly normalizing (thus decidable) rewriting system for the calculus, that stays connuent when allowing unbounded recur...
متن کاملSimulating Expansions without Expansions
We add extensional equalities for the functional and product types to the typed -calculus with not only products and terminal object, but also sums and bounded recursion (a version of recursion that does not allow recursive calls of infinite length). We provide a confluent and strongly normalizing (thus decidable) rewriting system for the calculus, that stays confluent when allowing unbounded r...
متن کاملExtensional Theories and Rewriting
This paper is an attempt to develop a unifying algebraic framework for extensional theories capturing formally the informal concept of extensionality, as well as a generic automated proving technique, called extensional rewriting, that can be instantiated and then used to prove equational properties in various particular extensional theories.
متن کاملRewriting with Extensional Polymorphic λ-calculus
We provide a confluent and strongly normalizing rewriting system, based on expansion rules, for the extensional second order typed lambda calculus with product and unit types: this system corresponds to the Intuitionistic Positive Calculus with implication, conjunction, quantification over proposition and the constant True. This result is an important step towards a new theory of reduction base...
متن کامل